Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity
نویسندگان
چکیده
In this paper we present a strategy to construct 1-resilient Boolean functions with very good nonlinearity and autocorrelation. Our strategy to construct a 1-resilient function is based on modifying a bent function, by toggling some of its output bits. Two natural questions that arise in this context are “at least how many bits and which bits in the output of a bent function need to be changed to construct a 1-resilient Boolean function”.We present an algorithm which determines a minimum number of bits of a bent function that need to be changed to construct a 1resilient Boolean function. We also present a technique to compute points whose output in the bent function need to be modified to get a 1-resilient function. In particular, the technique is applied upto 14-variable functions and we show that the construction provides 1-resilient functions reaching currently best known nonlinearity and achieving very low autocorrelation absolute indicator values which were not known earlier.
منابع مشابه
A New Construction of Resilient Boolean Functions with High Nonlinearity
In this paper we develop a technique that allows us to obtain new effective construction of 1-resilient Boolean functions with very good nonlinearity and autocorrelation. Our strategy to construct a 1-resilient function is based on modifying a bent function, by toggling some of its output bits. Two natural questions that arise in this context are “at least how many bits and which bits in the ou...
متن کاملMinimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to be tight for functions up to 10 input variables. As a consequence, we present a strategy to modify the bent functions, by toggling some of its outputs, in getting a large class of 1-resilient functions with very good...
متن کاملConstruction of Cryptographically Important Boolean Functions
Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean function is said to be correlation immune if its output leaks no information about its input values. Balanced correlation immune functions are called resilient functions. Finding methods for easy construction of resilient functions with additional properties is an active research area. Maitra and Pa...
متن کاملConstruction of Odd-Variable Resilient Boolean Functions with Optimal Degree
In this paper, we investigate the problem of obtaining new construction methods for resilient Boolean functions. Given n (n odd and n ≥ 35), we firstly provide degree optimized 1-resilient n-variable functions with currently best known nonlinearity. Then we extend our method to obtain m-resilient (m > 1) Boolean functions with degree n − m − 1, we show that these Boolean functions also achieve ...
متن کاملNew Constructions for Resilient and Highly Nonlinear Boolean Functions
We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables with nonlinearity 2n−1−2(n−1)/2, n odd. The Hadamard transform of these functions is 3-valued, which limits the efficiency of certain stream cipher attacks. From the case for n odd, we construct highly nonlinear 1-resilient functi...
متن کامل